Sorting algorithms for broadcast communications: mathematical analysis

Sorting algorithms for broadcast communications: mathematical analysis

Assume that n persons communicate via a channel; to each person a certain number is attached, and the goal is to see the numbers of all persons, e. g. in order to sort them. In this paper three algorithms to achieve this are analyzed with respect to the average number of rounds. While a precise description of the algorithmic aspects can be found in the companion paper [14], we concentrate here ...

Parallel Graph Algorithms Based Upon Broadcast Communications

In this paper, we shall show some common guidelines which we can use to design parallel algorithms under the single-channel broadcast communication model. We use several graph problems as a vehicle. The graph problems we solve include topological ordering, the connected component problem, breadth-first search, and depth-first search. If an ideal conflict resolution scheme is used, all of our al...

Distributed selectsort sorting algorithms on broadcast communication networks

In this paper, a distributed selectsort algorithm and a parameterized selectsort algorithm are presented to be applied on distributed systems for cases when N >> P where N is the number of elements to be sorted and P is the number of processors in the system. The distributed system considered in this paper uses a broadcasting channel for communication between processors. We show that the number...

Static Program Analysis for Recognizing Sorting Algorithms

Mathematical Analysis of Evolutionary Algorithms for Optimization

Simulating evolution as seen in nature has been identified as one of the key computing paradigms for the new decade. Today evolutionary algorithms have been successfully used in a number of applications. These include discrete and continuous optimization problems, synthesis of neural networks, synthesis of computer programs from examples (also called genetic programming) and even evolvable hard...